منابع مشابه
Third-Order Idealized Algol with Iteration Is Decidable
The problems of contextual equivalence and approximation are studied for the third-order fragment of Idealized Algol with iteration (IA∗3). They are approached via a combination of game semantics and language theory. It is shown that for each IA∗3-term one can construct a pushdown automaton recognizing a representation of the strategy induced by the term. The automata have some additional prope...
متن کاملLambda Deenability Is Decidable for Second Order Types and for Regular Third Order Types
It has been proved by Loader 1] that Statman-Plotkin conjecture (see 4] and 2]) fails. The Loader proof was done by encoding the word problem in the full type hierarchy based on the domain with 7 elements. The aim of this paper is to show that the lambda deenability problem limited for second order types and regular third order types is decidable in any nite domain. Obviously deenability is dec...
متن کاملDecidable Higher Order Subtyping
This paper establishes the decidability of typechecking in Fω ∧ , a typed lambda calculus combining higher-order polymorphism, subtyping, and intersection types. It contains the first proof of decidability of subtyping for a higher-order system.
متن کاملDecidable Matching for Convergent Systems
We describe decision procedures for certain classes of semantic matching problems, where the equational theory with respect to which the semantic matching is performed has a convergent rewrite system. We give counterexamples to show that semantic matching becomes undecidable (as it generally is) when the conditions we give are weakened.
متن کاملLambda definability is decidable for regular forth order types
It has been proved by Loader [2] that Statman-Plotkin conjecture (see [5] and [4]) fails. The Loader proof was done by encoding the word problem in the full type hierarchy based on the domain with 7 elements. Later Loader refined the result by establishing that the problem is undecidable for every finite domain with 3 ground elements [3]. The remaining non trivial case with 2 ground elements ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1994
ISSN: 0168-0072
DOI: 10.1016/0168-0072(94)90083-3